An Inverse Problem Statistical Methodology Summary
نویسندگان
چکیده
We discuss statistical and computational aspects of inverse or parameter estimation problems based on Ordinary Least Squares and Generalized Least Squares with appropriate corresponding data noise assumptions of constant variance and nonconstant variance (relative error), respectively. Among the topics included here are mathematical model, statistical model and data assumptions, and some techniques (residual plots, sensitivity analysis, model comparison tests) for verifying these. The ideas are illustrated throughout with the popular logistic growth model of Verhulst and Pearl as well as with a recently developed population level model of pneumococcal disease spread.
منابع مشابه
Damage Assessment using an Inverse Fracture Mechanics approach
This paper studies the application of an inverse methodology for problem solving in fracture mechanics using the finite element analysis. The method was applied to both detection of subsurface cracks and the study of propagating cracks. The procedure for detection of subsurface cracks uses a first order optimization analysis coupled with a penalty function to solve for the unknown geometric par...
متن کاملAN INVERSE PROBLEM WITH UNKNOWN RADIATION TERM
In this paper, we consider an inverse problem of linear heat equation with nonlinear boundary condition. We identify the temperature and the unknown radiation tern from an overspecified condition on the boundary
متن کاملParameter Identification for a Dispersive Dielectric in 2d Electromagnetics: Forward and Inverse Methodology with Statistical Considerations
We present methodology for obtaining forward solutions to Maxwell’s equations in two dimensions, in the presence of a Debye medium. Perfectly matched layer (PML) absorbing boundary conditions are used to absorb incoming energy at the finite boundaries. A time-domain, PDE formulation is presented, and a finite difference timedomain (FDTD) algorithm is used to obtain numerical solutions. A least ...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملA Uniqueness Theorem of the Solution of an Inverse Spectral Problem
This paper is devoted to the proof of the unique solvability ofthe inverse problems for second-order differential operators withregular singularities. It is shown that the potential functioncan be determined from spectral data, also we prove a uniquenesstheorem in the inverse problem.
متن کامل